Ergodic Optimization
نویسندگان
چکیده
Let f be a real-valued function defined on the phase space of a dynamical system. Ergodic optimization is the study of those orbits, or invariant probability measures, whose ergodic f -average is as large as possible. In these notes we establish some basic aspects of the theory: equivalent definitions of the maximum ergodic average, existence and generic uniqueness of maximizing measures, and the fact that every ergodic measure is the unique maximizing measure for some continuous function. Generic properties of the support of maximizing measures are described in the case where the dynamics is hyperbolic. A number of problems are formulated.
منابع مشابه
Ergodic Results in Subgradient Optimization
Subgradient methods are popular tools for nonsmooth, convex minimization , especially in the context of Lagrangean relaxation; their simplicity has been a main contribution to their success. As a consequence of the nonsmoothness, it is not straightforward to monitor the progress of a subgradient method in terms of the approximate fulllment of optimality conditions, since the subgradients used i...
متن کاملAn Abelian Limit Approach to a Singular Ergodic Control Problem
We consider an ergodic stochastic control problem for a class of one-dimensional Itô processes where the available control is an added bounded variation process. The corresponding infinite horizon discounted control problem is solved in [28]. Here, we show that, as the discount factor approaches zero, the optimal strategies derived in [28] “converge” to an optimal strategy for the ergodic contr...
متن کاملErgodic BSDEs and Optimal Ergodic Control in Banach Spaces
In this paper we introduce a new kind of Backward Stochastic Differential Equations, called ergodic BSDEs, which arise naturally in the study of optimal ergodic control. We study the existence, uniqueness and regularity of solution to ergodic BSDEs. Then we apply these results to the optimal ergodic control of a Banach valued stochastic state equation. We also establish the link between the erg...
متن کاملErgodic, primal convergence in dual subgradient schemes for convex programming
Lagrangean dualization and subgradient optimization techniques are frequently used within the field of computational optimization for finding approximate solutions to large, structured optimization problems. The dual subgradient scheme does not automatically produce primal feasible solutions; there is an abundance of techniques for computing such solutions (via penalty functions, tangential app...
متن کاملTwo Characterizations of Success of Ergodic Markov Chain Families for Combinatorial Optimization
Randomized search heuristics are widely used for solving combinatorial optimization problems. Randomized search heuristics can often be modeled, either directly, or after some simple modifications, as families of ergodic Markov chains, where each chain has a goal state that corresponds to the optimum. Such a family is termed successful if every chain, starting from any state, reaches its goal s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005